Shortest-path and Hot-potato Routing on Unbuuered Toroidal Networks

We probabilistically model dynamic packet routing on unbuuered 2-D and 3-D toroidal networks. We consider shortest-path routing with packet loss and retrans-missions versus a newly proposed all-link busy (ALB) hot-potato routing strategy with packet deeections. Computations of the sustained packet generating rate, node throughput, and average packet latency indicate that the proposed ALB strategy is a much better alternative to a shortest-path routing on unbuuered tori. It achieves an almost optimal sustained packet generating rate, near-optimal latency, and acceptable node throughput.